The Tendency of Development and Application of Service Robots for Defense, Rescue and Security

The development of sensor, information and communication technology, or new technology, has contributed to the development of robot technology. A new generation of service robots has been developed, and the highest number of their practical applications is for defense and security. Progress and development of information technology, sensor technology and servo-drive is responsible for the development of over 600 different types or prototype service robots. Service robots are designed for professional jobs and service jobs that are used in everyday life. The rapid development of computer management enabled the rapid development of various service robots that can move independently, autonomously exchange information with their surroundings and act completely autonomously (UV Unmanned Vehicles - vehicles that operate autonomously without human management). They can be used in all operating conditions on land, air and water, which is most important for the development of service robots for defense and security. Different applications of service robots for defense and security have been developed, and some are described in the paper, as well as the tendency of their application in the recent years. A large number of service robots for defense and security were developed, which are used for obtaining information about the vulnerability of human populations during earthquakes, fires or military activities. After obtaining information, we can make proper decisions that will serve the purpose of rescue and assistance to the ones in danger. The tendency of application of service robots for security and defense is constantly rising in the past few years. It is estimated that the development of sophisticated service robots for defense, rescue and security will continue in the future, and the number of applications will increase

Projection methods in conic optimization

There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of applications in science, finance and engineering. This chapter reviews some of these algorithms, emphasizing the so-called regularization algorithms for linear conic optimization, and applications in polynomial optimization. This is a presentation of the material of several recent research articles; we aim here at clarifying the ideas, presenting them in a general framework, and pointing out important techniques

An application of the Lovasz-Schrijver M(K,K) operator to the stable set problem

Although the lift-and-project operators of Lovász and Schrijver have been the subject of intense study, their M(K, K) operator has received little attention. We consider an application of this operator to the stable set problem. We begin with an initial linear programming (LP) relaxation consisting of clique and non-negativity inequalities, and then apply the operator to obtain a stronger extended LP relaxation. We discuss theoretical properties of the resulting relaxation, describe the issues that must be overcome to obtain an effective practical implementation, and give extensive computational results. Remarkably, the upper bounds obtained are sometimes stronger than those obtained with semidefinite programming techniques

Binary positive semidefinite matrices and associated integer polytopes

We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to consider the associated integer polytopes. Several important and well-known integer polytopes (the cut, boolean quadric, multicut and clique partitioning polytopes) are shown to arise as projections of binary psd polytopes. Finally, we present various valid inequalities for binary psd polytopes, and show how they relate to inequalities known for the simpler polytopes mentioned. Along the way, we answer an open question in the literature on the max-cut problem, by showing that the so-called k-gonal inequalities define a polytope

Autonomic nervous system activation mediates the increase in whole-body glucose uptake in response to electroacupuncture

A single bout of low-frequency electroacupuncture (EA) causing muscle contractions increases whole-body glucose uptake in insulin-resistant rats. We explored the underlying mechanism of this finding and whether it can be translated into clinical settings. Changes in glucose infusion rate (GIR) were measured by euglycemic-hyperinsulinemic clamp during and after 45 min of low-frequency EA in 21 overweight/obese women with polycystic ovary syndrome (PCOS) and 21 controls matched for age, weight, and body mass index (experiment 1) and in rats receiving autonomic receptor blockers (experiment 2). GIR was higher after EA in controls and women with PCOS. Plasma serotonin levels and homovanillic acid, markers of vagal activity, decreased in both controls and patients with PCOS. Adipose tissue expression of pro-nerve growth factor (proNGF) decreased, and the mature NGF/proNGF ratio increased after EA in PCOS, but not in controls, suggesting increased sympathetic-driven adipose tissue metabolism. Administration of α-/β-adrenergic receptor blockers in rats blocked the increase in GIR in response to EA. Muscarinic and dopamine receptor antagonist also blocked the response but with slower onset. In conclusion, a single bout of EA increases whole-body glucose uptake by activation of the sympathetic and partly the parasympathetic nervous systems, which could have important clinical implications for the treatment of insulin resistance.-Benrick, A., Kokosar, M., Hu, M., Larsson, M., Maliqueo, M., Marcondes, R. R., Soligo, M., Protto, V., Jerlhag, E., Sazonova, A., Behre, C. J., Højlund, K., Thorén, P., Stener-Victorin, E. Autonomic nervous system activation mediates the increase in whole-body glucose uptake in response to electroacupuncture